On the Randić index of quasi-tree graphs

نویسندگان

  • Mei Lu
  • Jinwu Gao
چکیده

In studying branching properties of alkanes, several numbering schemes for the edges of the associated hydrogen-suppressed graph were proposed based on the degrees of the end vertices of an edge [11]. To preserve rankings of certain molecules, some inequalities involving the weights of edges needed to be satisfied. Randić [11] stated that weighting all edges uv of the associated graph G by (d(u)d(v))−1/2 preserved these inequalities, where d(u) and d(v) are the degrees of u and v. The sum of weights over all edges of G, which is called the Randić index or molecular connectivity index or simply connectivity index of G and denoted by R(G), has been closely correlated with many chemical properties [8] and found to parallel the boiling point, Kovats constants, and a calculated surface. In addition, the Randić index appears to predict the boiling points of alkanes more closely, and only it takes into account the bonding or adjacency degree among carbons in alkanes (see [9]). It is said in [7] that Randić index “together with its generalizations it is certainly the molecular-graph-based structuredescriptor, that found the most numerous applications in organic chemistry,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Modified Randić Index of Trees, Unicyclic Graphs and Bicyclic Graphs

The modified Randić index of a graph G is a graph invariant closely related to the classical Randić index, defined as

متن کامل

On the Randić index and Diameter of Chemical Graphs

Using the AutoGraphiX 2 system, Aouchiche, Hansen and Zheng [2] proposed a conjecture that the difference and the ratio of the Randić index and the diameter of a graph are minimum for paths. We prove this conjecture for chemical graphs.

متن کامل

The second geometric-arithmetic index for trees and unicyclic graphs

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

متن کامل

About a conjecture on the Randić index of graphs

For an edge uv of a graph G, the weight of the edge e = uv is denoted by w(e) = 1/ √ d(u)d(v). Then

متن کامل

On a Variation of Randić Index

Randić index, R, also known as the connectivity or branching index, is an important topological index in chemistry. In order to attack some conjectures concerning Randić index, Dvořák et al. [5] introduced a modification of this index, denoted by R′. In this paper we present some of the basic properties of R′. We determine graphs with minimal and maximal values of R′, as well as graphs with min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007